Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects

The Shortest Path (SP) problem resembles a variety of real-world situations where one needs to find paths between origins and destinations. A generalization the SP is Dynamic (DSP) problem, which also models changes in graph at any time. When changes, DSP algorithms partially recompute while taking advantage previous computations. Although represents many real situations, it leaves out some fundamental aspects decision-making. One these existence multiple, potentially conflicting objectives that must be optimized simultaneously. Recently, we performed first incursion on so-called Multi-Objective (MODSP), presenting algorithm able take MODM perspective into account when solving problem. In this paper, go beyond formally define MODSP thus establishing clarifying with respect its simpler counterparts. particular, start brief overview related literature then present complete formalization class, highlighting distinguishing features as compared similar problems representing their relationship through novel taxonomy. This work motivates relevance by enumerating scenarios involve all ingredients, such multiple dynamically updated topologies. Finally, discuss challenges open questions for new class shortest path problems, aiming future directions. We hope sheds light theme contributes leveraging relevant research topic.